منابع مشابه
Hypercube Embeddings of Wythoffians
The Wythoff construction takes a d-dimensional polytope P , a subset S of {0, . . . , d} and returns another d-dimensional polytope P (S). If P is a regular polytope, then P (S) is vertex-transitive. This construction builds a large part of the Archimedean polytopes and tilings in dimension 3 and 4. We want to determine, which of those Wythoffians P (S) with regular P have their skeleton or dua...
متن کاملFixed Hypercube Embedding
In this paper, we consider the problem of embedding a given graph into a fixed-size hypercube. This work is related to other recent research on hypercube embedding. In [1], Bhat describes an order IVl log2 IVI algorithm for testing whether a given graph G = (V, E) is exactly an n-cube. Deciding whether a graph has a distance-preserving embedding into a hypercube can be done in polynomial time [...
متن کاملEmbedding of Hypercube into Cylinder
Task mapping in modern high performance parallel computers can be modeled as a graph embedding problem, which simulates the mapping as embedding one graph into another and try to find the minimum wirelength for the mapping. Though embedding problems have been considered for several regular graphs, such as hypercubes into grids, binary trees into grids, et al, it is still an open problem for hyp...
متن کاملHypercube Embedding of Distances with Few Values Hypercube Embedding of Distances with Few Values
A distance d on a nite set V is hypercube embeddable if it can be isometrically embedded into the hypercube f0; 1g m for some m 1, i.e., if the elements i 2 V can be labeled by sets A i in such a way that d(i; j) = jA i 4A j j for all i; j 2 V. Testing whether a distance d is hypercube embeddable is an NP-complete problem, even if d is assumed to take its values in f2; 3; 4; 6g ((Chv80]). On th...
متن کاملHypercube Embedding of Generalized Bipartite Metrics
A metric d is h-embeddable if it can be isometrically embedded in some hypercube. Equivalently, d is h-embeddable if d can be written as a nonnegative integer combination of cut metrics. The problem of testing h-embeddability is NP-complete (Chvbta!, 1980). A good characterization of h-embeddability permitting a polynomial-time algorithm was given for several classes of metrics, in particular, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ars Mathematica Contemporanea
سال: 2008
ISSN: 1855-3974,1855-3966
DOI: 10.26493/1855-3974.26.6c7